feat(list): add advanced linked list algorithms (reverse, swap pairs, rotate) with tests#1
Open
cto-new[bot] wants to merge 1 commit intodevfrom
Open
feat(list): add advanced linked list algorithms (reverse, swap pairs, rotate) with tests#1cto-new[bot] wants to merge 1 commit intodevfrom
cto-new[bot] wants to merge 1 commit intodevfrom
Conversation
Adds several common linked list algorithms including full reverse (with new list), in-place reverse, pairwise node swap, and cyclic rotate left/right. These are bundled under `linked_list_algo.go` with comprehensive test coverage in `linked_list_algo_test.go`. This enhancement provides essential utilities for list data manipulation, aligning with typical algorithmic expectations and improving reusability of the linked list. No breaking changes. Migration is not required.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
This PR adds several widely used linked list algorithms for the doubly-linked list implementation, including reverse, in-place reverse, pairwise swapping, and cyclic rotation, along with comprehensive tests for each algorithm.
Details
Reverse,ReverseSelf,SwapPairs,RotateLeft, andRotateRightfunctions forLinkedListinlinked_list_algo.go.linked_list_algo_test.goproviding high-coverage unit tests for all new algorithms, covering edge cases and typical scenarios.